An electromagnetism-like method for the maximum set splitting problem
نویسندگان
چکیده
منابع مشابه
AN ELECTROMAGNETISM-LIKE ALGORITHM FOR FIXED CHARGE SOLID TRANSPORTATION PROBLEM
Fixed charge solid transportation problem (FCSTP) is one of the main and most important problems in transportation and network research areas. To tackle such an NP-hard problem, An Electromagnetism-like algorithm (EM) is employed. To the best of our knowledge, EM has been considered for any kind of transportation problems. Due to the significant role of parameters on the algorithm’s performance...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملAn electromagnetism metaheuristic for the unicost set covering problem
0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.01.035 * Corresponding author. Tel.: +39 51 2093028; fax: E-mail addresses: [email protected] (Z. Na (P. Toth), [email protected] (L. Galli). In this paper we propose a new heuristic algorithm to solve the unicost version of the well-known set covering problem. The method is based on the electromagnetism metaheuris...
متن کاملelectromagnetism-like algorithms for the fuzzy fixed charge transportation problem
in this paper, we consider the fuzzy fixed-charge transportation problem (ffctp). both of fixed and transportation cost are fuzzy numbers. contrary to previous works, electromagnetism-like algorithms (em) is firstly proposed in this research area to solve the problem. three types of em; original em, revised em, and hybrid em are firstly employed for the given problem. the latter is being firstl...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2013
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor110704010k